in ri a - 00 00 07 53 , v er si on 1 - 1 6 N ov 2 00 5 Truly On - The - Fly LTL Model Checking

نویسنده

  • Stephan Merz
چکیده

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan’s algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c s . L O / 0 51 10 61 v 1 1 6 N ov 2 00 5 Truly On - The - Fly LTL Model Checking

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a varia...

متن کامل

ha l - 00 11 54 20 , v er si on 1 - 2 1 N ov 2 00 6 Learning and discrimination through STDP in a top - down modulated associative memory ∗

This article underlines the learning and discrimination capabilities of a model of associative memory based on artificial networks of spiking neurons. Inspired from neuropsychology and neurobiology, the model implements top-down modulations, as in neocortical layer V pyramidal neurons, with a learning rule based on synaptic plasticity (STDP), for performing a multimodal association learning tas...

متن کامل

Constraints-based Verification of Parameterized Cryptographic Protocols

Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroder very few address the more challenging class of group protocols. We present a synchronous model for group protocols, that generalizes st...

متن کامل

RTES-03 Interfaces.indd

[ B ur ns 20 07 ] B u rn s, A & W el lin gs , A C o n cu rr en t a n d R ea l-T im e Pr o gr am m in g in A d a, e d it io n C am b ri d ge U n iv er si ty P re ss 2 00 7 [ M o to ro la 19 96 ] M o to ro la Ti m e Pr o ce ss in g U n it R ef er en ce M an u al 1 99 6 p p . 1 -1 42 [ M o to ro la 20 00 ] M o to ro la M PC 56 5 & M PC 56 6 2 00 0 p p . 1 -1 31 2 [ P ea co ck 19 97 ] Pe ac o ck , ...

متن کامل

ha l - 00 11 52 83 , v er si on 1 - 2 1 N ov 2 00 6 Optical Coherence Spectro - Tomography by all - Optical Depth - Wavelength analysis

Current spectroscopic optical coherence tomography (OCT) methods rely on a posteriori numerical calculation. We present an alternative for accessing optically the spectroscopic information in OCT, i.e. without any post-processing, by using a grating based correlation and a wavelength demultiplexing system. Conventional A-scan and spectrally resolved A-scan are directly recorded on the image sen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005